Computably Categorical Structures and Expansions by Constants

نویسندگان

  • Peter Cholak
  • Sergei S. Goncharov
  • Bakhadyr Khoussainov
  • Richard A. Shore
چکیده

Effective model theory is the subject that analyzes the typical notions and results of model theory to determine their effective content and counterparts. The subject has been developed both in the former Soviet Union and in the west with various names (recursive model theory, constructive model theory, etc.) and divergent terminology. (We use “effective model theory” as the ∗Partially supported by a Mathematical Sciences Postdoctoral Research Fellowship and ARO through MSI, Cornell University, DALL03-91-C0027 †Partially supported by ISF, NQ6000 and NQ6300, and by ARO through MSI, Cornell University, DAAL03-91-C0027. ‡Partially supported by ARO through MSI, Cornell University, DAAL03-91-C0027. §Partially supported by NSF Grant DMS-9204308, DMS-9503503 and ARO through MSI, Cornell University, DAAL-03-C-0027.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective categoricity of equivalence structures

We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence classes, or A has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are rela...

متن کامل

Computability Theoretic Properties of Injection Structures

We study computability theoretic properties of computable injection structures and the complexity of isomorphisms between these structures. We prove that a computable injection structure is computably categorical if and only if it has finitely many infinite orbits. We also prove that a computable injection structure is ∆2 categorical if and only if it has finitely many orbits of type ω or finit...

متن کامل

Computably isometric spaces

We say that an uncountable metric space is computably categorical if every two computable structures on this space are equivalent up to a computable isometry. We show that Cantor space, the Urysohn space, and every separable Hilbert space are computably categorical, but the space C[0, 1] of continuous functions on the unit interval with the supremum metric is not. We also characterize computabl...

متن کامل

On Computable Categoricity

We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. In particular, we show that every 1-decidable computably categorical structure is relatively ∆2-categorical, but that there is a computably categorical structure that is not even relatively arithmetically categorical. We also...

متن کامل

Effective Categoricity of Equivalence Structures FINAL DRAFT

We consider only countable structures for computable languages with universe ω. We identify sentences with their Gödel codes. The atomic diagram of a structure A for L is the set of all quantifier-free sentences in LA, L expanded by constants for the elements in A, which are true in A. A structure is computable if its atomic diagram is computable. In other words, a structure A is computable if ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 64  شماره 

صفحات  -

تاریخ انتشار 1999